Non-local network dynamics via fractional graph Laplacians
نویسندگان
چکیده
منابع مشابه
Dynamics of non-local systems handled by fractional calculus
Mechanical vibrations of non-local systems with long-range, cohesive, interactions between material particles have been studied in this paper by means of fractional calculus. Long-range cohesive forces between material particles have been included in equilibrium equations assuming interaction distance decay with order α . This approach yields as limiting case a partial fractional differential e...
متن کاملIntelligent identification of vehicle’s dynamics based on local model network
This paper proposes an intelligent approach for dynamic identification of the vehicles. The proposed approach is based on the data-driven identification and uses a high-performance local model network (LMN) for estimation of the vehicle’s longitudinal velocity, lateral acceleration and yaw rate. The proposed LMN requires no pre-defined standard vehicle model and uses measurement data to identif...
متن کاملDuality and nonlinear graph Laplacians
We present an iterative algorithm for solving a class of nonlinear Laplacian system of equations in Õ(km log(kn/ǫ)) iterations, where k is a measure of nonlinearity, n is the number of variables, m is the number of nonzero entries in the graph Laplacian L, ǫ is the solution accuracy and Õ() neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by o...
متن کاملKernels of Directed Graph Laplacians
Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D − Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of G. This fact has a meaningful generalization to directed graphs, as was observ...
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2020
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnaa017